Implementation of SHA-3 Algorithm Based On ARM-11 Processors
نویسندگان
چکیده
منابع مشابه
SHA-3 on ARM11 Processors
This paper presents high-speed assembly implementations of the 256-bit-output versions of all five SHA-3 finalists and of SHA-256 for the ARM11 family of processors. We report new speed records for all of the six implemented functions. For example our implementation of the round-3 version of JH-256 is 35% faster than the fastest implementation of the round-2 version of JH-256 in eBASH. Scaled w...
متن کاملC Implementation of SHA-256 Algorithm
Hash functions play an important role in modern cryptography. Hash functions are widely used to provide services of data integrity and when they are used in combination with digital signature algorithms and MACs, they also provide authentication. In this paper a different scheme is proposed to improve the performance of the hardware implementation of the SHA-256 algorithm. The main focus of the...
متن کاملEfficient Implementation of Bilinear Pairings on ARM Processors
As hardware capabilities increase, low-power devices such as smartphones represent a natural environment for the efficient implementation of cryptographic pairings. Few works in the literature have considered such platforms despite their growing importance in a postPC world. In this paper, we investigate the efficient computation of the Optimal-Ate pairing over Barreto-Naehrig curves in softwar...
متن کاملBuffer Management Algorithm Design and Implementation Based on Network Processors
To solve the parameter sensitive issue of the traditional RED (random early detection) algorithm, an adaptive buffer management algorithm called PAFD (packet adaptive fair dropping) is proposed. This algorithm supports DiffServ (differentiated services) model of QoS (quality of service). In this algorithm, both of fairness and throughput are considered. The smooth buffer occupancy rate function...
متن کاملDiscussion of One Improved Hash Algorithm Based on MD 5 and SHA 11
We have devised one 160 bits improved hash algorithm based on MD5 and SHA1. And in additional, we also introduce four assistant functions named:F(X,Y,Z), G(X,Y,Z), H(X,Y,Z), and I(X,Y,Z) to do 4 rounds of 16 steps iterative operation with 32-bit data as input and 32-bit as output, saving in A, B, C, D respectively. Then we use one new extending function K(X,Y,Z) to expand 32-bit A, B, C, D to 4...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korea Institute of Information Security and Cryptology
سال: 2015
ISSN: 1598-3986
DOI: 10.13089/jkiisc.2015.25.4.749